- approximate factorization
- приближенная факторизация
Авиасловарь. М.А.Левин. 2004.
approximate factorization
Смотреть что такое "approximate factorization" в других словарях:
Non-negative matrix factorization — NMF redirects here. For the bridge convention, see new minor forcing. Non negative matrix factorization (NMF) is a group of algorithms in multivariate analysis and linear algebra where a matrix, , is factorized into (usually) two matrices, and… … Wikipedia
Invariant factorization of LPDOs — IntroductionFactorization of linear ordinary differential operators (LODOs) is known to be unique and in general, it finally reduces to the solution of a Riccati equation [http://en.wikipedia.org/wiki/Riccati equation] , i.e. factorization of… … Wikipedia
Fermat's factorization method — is based on the representation of an odd integer as the difference of two squares: :N = a^2 b^2. That difference is algebraically factorable as (a+b)(a b); if neither factor equals one, it is a proper factorization of N .Each odd number has such… … Wikipedia
Splitting circle method — In mathematics, the splitting circle method is a numerical algorithm for the numerical factorization of a polynomial and, ultimately, for finding its complex roots. It was introduced by Arnold Schönhage in his 1982 paper The fundamental theorem… … Wikipedia
Stone method — Stone s method, also known as the strongly implicit procedure or SIP, is an algorithm for solving a sparse linear system of equations. The method uses an incomplete LU decomposition, which approximates the exact LU decomposition, to get an… … Wikipedia
Fast Fourier transform — A fast Fourier transform (FFT) is an efficient algorithm to compute the discrete Fourier transform (DFT) and its inverse. There are many distinct FFT algorithms involving a wide range of mathematics, from simple complex number arithmetic to group … Wikipedia
Timeline of mathematics — A timeline of pure and applied mathematics history. Contents 1 Before 1000 BC 2 1st millennium BC 3 1st millennium AD 4 1000–1500 … Wikipedia
List of numerical analysis topics — This is a list of numerical analysis topics, by Wikipedia page. Contents 1 General 2 Error 3 Elementary and special functions 4 Numerical linear algebra … Wikipedia
Ruffini's rule — In mathematics, Ruffini s rule allows the rapid division of any polynomial by a binomial of the form x − r . It was described by Paolo Ruffini in 1809. Ruffini s rule is a special case of long division when the divisor is a linear factor. Ruffini … Wikipedia
Time complexity — In computer science, the time complexity of an algorithm quantifies the amount of time taken by an algorithm to run as a function of the size of the input to the problem. The time complexity of an algorithm is commonly expressed using big O… … Wikipedia
Singular value decomposition — Visualization of the SVD of a 2 dimensional, real shearing matrix M. First, we see the unit disc in blue together with the two canonical unit vectors. We then see the action of M, which distorts the disk to an ellipse. The SVD decomposes M into… … Wikipedia
